Lower and Upper Bounds on the Distribution of Computation for Sequential Decoding of Specific Linear Tree Codes.

نویسنده

  • Vladimir B. Balakirsky
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Decoding of Lattice Codes

We consider lattice tree-codes based on a latt ice A having a finite trellis diagram T . Such codes are easy to encode and benefit f rom the structure of A. Sequential decoding of lattice tree-codes is studied, and the corresponding Fano metric is derived. A n upper bound on the running time of the sequential decoding algorithm is established, and found to resemble the Pareto distribution. O u ...

متن کامل

An Upper Bound on the First Zagreb Index in Trees

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

متن کامل

Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial

This article is focused on the performance evaluation of linear codes under maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, the analysis of linear codes under ML decoding allows to predict their performance without resorting to computer simulations. In this article, upper and lower bounds on the error probability of linear co...

متن کامل

Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen’s based bounds and their improvements, sphere-packing ...

متن کامل

Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of arbitrary parity-check matrices are expressed in terms of the gap between the rate of these codes for which reliable communication is achievable and the channel cap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007